The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
نویسندگان
چکیده
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of triangles in the terrain, we show the following two results. (i) If the triangles of the terrain have bounded slope and the projection of the set of triangles onto the xy-plane has low density, then the worst-case complexity of a bisector is Θ(n). (ii) If, in addition, the triangles have similar sizes and the domain of the terrain is a rectangle of bounded aspect ratio, then the worst-case complexity of the Voronoi diagram of m point sites is Θ(n+m √ n).
منابع مشابه
Voronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کاملNew Results on Abstract Voronoi Diagrams
Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have got the same nearest site. This definition clearly depends on the type of given objects, they may be points, line segments, polygons, etc. and the distance measure used. To f...
متن کاملLocal differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions
This paper studies local properties of Voronoi diagrams of sets of disjoint compact convex sites in R. It is established that bisectors are C surfaces and trisectors are C curves, and that as a point moves along a trisector its clearance sphere develops monotonically (Lemma 2.4). This monotonicity property is useful in establishing the existence of Voronoi vertices bounding edges in certain sit...
متن کاملAbstract Voronoi diagrams revisited
Voronoi Diagrams Revisited Rolf Klein∗ Elmar Langetepe∗ Zahra Nilforoushan† Abstract Abstract Voronoi diagrams [21] were designed as a unifying concept that should include as many concrete types of diagrams as possible. To ensure that abstract Voronoi diagrams, built from given sets of bisecting curves, are finite graphs, it was required that any two bisecting curves intersect only finitely oft...
متن کاملRandomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters
This paper applies the randomized incremental construction (RIC) framework to computing the Hausdorff Voronoi diagram of a family of k clusters of points in the plane. The total number of points is n. The diagram is a generalization of Voronoi diagrams based on the Hausdorff distance function. The combinatorial complexity of the Hausdorff Voronoi diagram is O(n + m), where m is the total number...
متن کامل